Admissible rules for the multi modal logic of knowledge and time LTK1
نویسنده
چکیده
Multi-modal propositional logics with operators representing both time and knowledge are particularly effective to describe the interaction of agents throughout the flow of time ([1, 2, 3, 4, 5, 6]). These systems are usually generated by adding to an existing propositional logic two sets of modalities: one to model the flow of time and one to describe agents’ knowledge. The interaction of such modalities gives a precise account of the dynamic development of agents’ knowledge. However, despite the power of multi-modal propositional logics, multi-modal languages can only express formulae which are static in a way: the statements only fix a fact, and cannot handle a changing environment, although this is required to model human reasoning, computation and multi-agent environments. Sometimes it might be more useful to discover what follows given some premises, rather than knowing logical truths. For this purpose, inference rules, or logical consecutions, are a core instrument.
منابع مشابه
Logics with the universal modality and admissible consecutions
In this paper we study admissible consecutions (inference rules) in multi-modal logics with the universal modality. We consider extensions of multi-modal logic S4n augmented with the universal modality. Admissible consecutions form the largest class of rules, under which a logic (as a set of theorems) is closed. We propose an approach based on the context effective finite model property. Theore...
متن کاملPreservation of Admissible Rules when Combining Logics
Admissible rules are shown to be conservatively preserved by the meetcombination of a wide class of logics. A basis is obtained for the resulting logic from bases given for the component logics. Structural completeness and decidability of the set of admissible rules are also shown to be preserved, the latter with no penalty on the time complexity. Examples are provided for the meet-combination ...
متن کاملMulti-modal and Temporal Logics with Universal Formula - Reduction of Admissibility to Validity and Unification
The article studies multi-modal (in particular temporal, tense, logics) possessing universal formulas. We prove (Theorems 11 and 12) that the admissibility problem for inference rules (inference rules with parameters) is decidable for all decidable multi-modal (in particular, temporal) logics possessing an universal formula and decidable w.r.t. unification (unification with parameters). These t...
متن کاملDescription of Modal Logics Inheriting Admissible Rules for K4
We give a necessary and sufficient condition for any modal logic with fmp to inherit all inference rules admissible in S4. Using this condition we describe all tabular modal logics inheriting inference rules admissible for S4.
متن کاملHypersequent Systems for the Admissible Rules of Modal and Intermediate Logics
The admissible rules of a logic are those rules under which the set of theorems of the logic is closed. In a previous paper by the authors, formal systems for deriving the admissible rules of Intuitionistic Logic and a class of modal logics were defined in a proof-theoretic framework where the basic objects of the systems are sequent rules. Here, the framework is extended to cover derivability ...
متن کامل